From the support vector machine to the bounded constraint machine
نویسندگان
چکیده
منابع مشابه
From the Support Vector Machine to the Bounded Constraint Machine
The Support Vector Machine (SVM) has been successfully applied for classification problems in many different fields. It was originally proposed using the idea of searching for the maximum separation hyperplane. In this article, in contrast to the criterion of maximum separation, we explore alternative searching criteria which result in the new method, the Bounded Constraint Machine (BCM). Prope...
متن کاملLeast Squares Support Vector Machine for Constitutive Modeling of Clay
Constitutive modeling of clay is an important research in geotechnical engineering. It is difficult to use precise mathematical expressions to approximate stress-strain relationship of clay. Artificial neural network (ANN) and support vector machine (SVM) have been successfully used in constitutive modeling of clay. However, generalization ability of ANN has some limitations, and application of...
متن کاملOn the Support Vector Machine
Classification is a fundamental problem at the intersection of machine learning and statistics. Machine learning methods have enjoyed considerable empirical success. However, they often have an ad hoc quality. It is desirable to have hard theoretical results which might highlight specific quantitative advantages of these methods. The statistical methods often tackle the classification problem t...
متن کاملThe Neural Support Vector Machine
Abstract This paper describes a new machine learning algorithm for regression and dimensionality reduction tasks. The Neural Support Vector Machine (NSVM) is a hybrid learning algorithm consisting of neural networks and support vector machines (SVMs). The output of the NSVM is given by SVMs that take a central feature layer as their input. The feature-layer representation is the output of a num...
متن کاملThe Lq Support Vector Machine
The standard Support Vector Machine (SVM) minimizes the hinge loss function subject to the L2 penalty or the roughness penalty. Recently, the L1 SVM was suggested for variable selection by producing sparse solutions [BM, ZHRT]. These learning methods are non-adaptive since their penalty forms are pre-determined before looking at data, and they often perform well only in a certain type of situat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Its Interface
سال: 2009
ISSN: 1938-7989,1938-7997
DOI: 10.4310/sii.2009.v2.n3.a3